A Prolific Construction of Strongly Regular Graphs with the $n$-e.c. Property
نویسندگان
چکیده
منابع مشابه
A Prolific Construction of Strongly Regular Graphs with the n-e.c. Property
A graph is n-e.c. (n-existentially closed) if for every pair of subsets U , W of the vertex set V of the graph such that U ∩W = / 0 and |U |+ |W | = n, there is a vertex v ∈ V − (U ∪W ) such all edges between v and U are present and no edges between v and W are present. A graph is strongly regular if it is a regular graph such that the number of vertices mutually adjacent to a pair of vertices ...
متن کاملNew prolific constructions of strongly regular graphs
We present a purely combinatorial construction of strongly regular graphs with geometric parameters. The construction produces hyperexponentially many graphs, and uses neither linear algebra nor groups. Among the graphs constructed, there are graphs with parameters of a generalized quadrangle GQðn 1; nþ 1Þ which further produce distance regular covers of complete graphs. In this paper we presen...
متن کاملDistance-Regular Graphs with Strongly Regular Subconstituents
In [3] Cameron et al. classified strongly regular graphs with strongly regular subconstituents. Here we prove a theorem which implies that distance-regular graphs with strongly regular subconstituents are precisely the Taylor graphs and graphs with a1 = 0 and ai ∈ {0, 1} for i = 2, . . . , d .
متن کاملStrongly Regular Graphs with Parameters . . .
Using results on Hadamard difference sets, we construct regular graphical Hadamard matrices of negative type of order 4m for every positive integer m. If m > 1, such a Hadamard matrix is equivalent to a strongly regular graph with parameters (4m, 2m +m, m +m, m +m). Strongly regular graphs with these parameters have been called max energy graphs, because they have maximal energy (as defined by ...
متن کاملConstruction of Directed Strongly Regular Graphs Using Finite Incidence Structures
We use finite incident structures to construct new infinite families of directed strongly regular graphs with parameters (l(q−1)q, l(q−1)q, (lq−l+1)q, (l−1)(q−1)q, (lq−l+1)q) for integers q and l (q, l ≥ 2), and (lq(q − 1), lq(q − 1), lq − l + 1, (l − 1)(q − 1), lq − l + 1) for all prime powers q and l ∈ {1, 2, . . . , q}. The new graphs given by these constructions include those with parameter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2002
ISSN: 1077-8926
DOI: 10.37236/1647